#include<bits/stdc++.h>
using namespace std;
int lft,n;
int minn,maxx,has[100010],r[100010];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    minn=1<<30;
    maxx=0;
    for(int i=1;i<=n;i++){
        cin>>r[i];
        has[r[i]]++;
        minn=min(r[i],minn);
        maxx=max(r[i],maxx);
    }
    lft=has[minn];
    for(int i=minn+1;i<=maxx;i++){
        if(!has[i])continue;
        int now=has[i];
        if(now>=lft)lft=now;
    }
    cout<<lft<<endl;
    return 0;
}
